package blackRedTree;

import java.util.HashSet;
import java.util.Set;

public class Text {
    public static void main(String[] args) {
//        String s = ("xxxxxxx");
//        System.out.println(s);
        RBTree rbTree = new RBTree();//
        int[] nums = new int[]{18, 14,7, 2, 6, 1, 12, 204,16, 3, 1, 3, 14115, 0, 5, 15, 3, 715, 7, 16,9, 26 , 15};

        for (int i = 0; i < nums.length; i++) {
            rbTree.add(nums[i]);
        }
        System.out.println(rbTree.check());
        rbTree.inOrder(rbTree.root);
    }
}
